Random Infinite Squarings of Rectangles

نویسندگان

  • LOUIGI ADDARIO-BERRY
  • NICHOLAS LEAVITT
  • Oded Schramm
چکیده

A recent publication [1] introduced a growth procedure for planar maps, whose almost sure limit is “the uniform infinite 3-connected planar map”. A classical construction of Brooks, Smith, Stone and Tutte [7] associates a squaring of a rectangle (i.e. a tiling of a rectangle by squares) to any finite, edge-rooted planar map with nonseparating root edge. We use this construction together with the map growth procedure to define a growing sequence of squarings of rectangles. We prove that the sequence of squarings converges to an almost sure limit: a random infinite squaring of a finite rectangle. This provides a canonical planar embedding of the uniform infinite 3-connected planar map. We also show that the limiting random squaring almost surely has a unique point of accumulation. Un papier récément publié [1] introduit une procédure pour générer une suite de cartes aléatoires qui a presque surement comme limite la “carte 3-connexe infinie uniform”. La construction classique de Brooks, Smith, Stone et Tutte [7] associe à chaque carte fini, avec une arête racine qui n’est pas un isthme, un rectangle pavé par des carrés. Nous utilisons ces deux procédures à fin de générer une suite aléatoire de rectangles pavé par des carrés. Nous démontrons que cette suite a presque surement une limite qui est un rectangle aléatoire infiniment pavé par des carrés, et que cet objet a presque surement un seul point d’accumulation. Ceci fournit un plongement canonique de la carte 3-connexe infinie uniform dans le plan. (a) A random squaring of a rectangle with 6345 squares. (b) A magnification of a small region within the same squaring. Date: January 24, 2015.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rectangle and Square Representations of Planar Graphs

In the first part of this survey we consider planar graphs that can be represented by a dissections of a rectangle into rectangles. In rectangular drawings the corners of the rectangles represent the vertices. The graph obtained by taking the rectangles as vertices and contacts as edges is the rectangular dual. In visibility graphs and segment contact graphs the vertices correspond to horizonta...

متن کامل

On Tilings of Quadrants and Rectangles and Rectangular Pattern

The problem of tiling rectangles by polyominoes generated large interest. A related one is the problem of tiling parallelograms by twisted polyominoes. Both problems are related with tilings of (skewed) quadrants by polyominoes. Indeed, if all tilings of a (skewed) quadrant by a tile set can be reduced to a tiling by congruent rectangles (parallelograms), this provides information about tilings...

متن کامل

Infinite Homography Estimation Using Two Arbitrary Planar Rectangles

In this paper, we propose a new method to estimate an infinite homography between two views containing two arbitrary planar rectangles. The proposed method does not require metric measurements, such as rectangle lengths or aspect ratios of the rectangles. We introduce the concept of semi-metric cameras and show that the semi-metric cameras derived from different views that see an identical 3D r...

متن کامل

Optimal Packing of High-Precision Rectangles

The rectangle-packing problem consists of finding an enclosing rectangle of smallest area that can contain a given set of rectangles without overlap. Our new benchmark includes rectangles of successively higher precision, challenging the previous state-of-the-art, which enumerates all locations for placing rectangles, as well as all bounding box widths and heights up to the optimal box. We inst...

متن کامل

Expected measure of the union of random rectangles

An asymptotic expression for the expected area of the union of n random rectangles is derived by Mellin transforms, where their two diagonal corners are independently and uniformly distributed over (0, 1). The general result for d-dimensional hyper-rectangles is also stated. COMPUTATIONAL GEOMETRY, CONVEX HULL, GEOMETRIC PROBABILITY, GEOMETRY OF RECTANGLES, MELLIN TRANSFORM, CALCULUS OF FINITE ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015